Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
431	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics
432	Toward Local Search Programming: LocalSolver 1.0 Thierry Benoist1 , Bertrand Estellon2 , Fr´ed´eric Gardi1 , Karim Nouioua2 1 2 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-03-16 02:41:44 Computing Constraint programming Search algorithm Mathematical optimization Solver Local search Boolean data type Travelling salesman problem ALGOL 68 Operations research Software engineering Theoretical computer science
433	Evolution of a Path Generator for a Round-Trip Symmetric Traveling Salesperson Problem Using Genetic Programming Bretton Swope Stanford Mechanical Engineering Department Stanford University Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2006-11-17 21:29:24 Theoretical computer science Mathematical optimization Genetic algorithms Cybernetics Evolutionary algorithms Travelling salesman problem Greedy algorithm Fitness function Genetic programming Mathematics Applied mathematics Operations research
434	crosoft Word - 6455 2 Add to Reading List Source URL: www.icms.polyu.edu.hk Language: English - Date: 2010-09-25 04:18:22 Mathematics NP-complete problems Cybernetics Berth allocation problem Evolutionary algorithms Mathematical optimization Memetic algorithm Ant colony optimization algorithms Genetic algorithm Theoretical computer science Operations research Applied mathematics
435	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
436	Models and Strategies for Variants of the Job Shop Scheduling Problem Diarmuid Grimes1 and Emmanuel Hebrard2,3 1 3 Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2011-09-27 04:15:08 Applied mathematics Mathematics Constraint programming Job shop scheduling Boolean satisfiability problem Open shop scheduling Scheduling Shifting bottleneck heuristic Operations research Theoretical computer science Mathematical optimization
437	Microsoft Word - WADS0403.doc Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2005-03-01 07:12:32 Data Requirement Mathematical optimization Communications protocol Decomposition Software architecture Dependability Dantzig–Wolfe decomposition Problem frames approach Software development Software requirements Computing
438	Journal of Artificial Intelligence Research533 Submitted 12/13; publishedImproving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions Add to Reading List Source URL: jair.org Language: English - Date: 2014-06-30 19:43:41 Problem solving Admissible heuristic Mathematical optimization Fluent Innovation Science Applied mathematics Heuristics Logic in computer science Artificial intelligence
439	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
440	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics

UPDATE